Correction to the RUN DAP for conjunctive RAS presented in "Polynomial-complexity deadlock avoidance policies for sequential resource allocation systems"

This note first identifies a problem with the correctness of the RUN DAP for Conjunctive RAS, presented in the above paper,1 and it, subsequently, proceeds to the problem correction through an appropriate policy modification. More specifically, the first part of this note provides a counter example to the policy correctness (i.e., deadlock freedom of the controlled system) claimed in,1 while the second part introduces the proposed correction, and briefly argues the correctness of the modified DAP. A more detailed mathematical treatment of RUN DAP in the Petri net formalism, and its redefinition so that it covers the broader class of Conjunctive/Disjunctive RAS, can be found in [1]. For the sake of brevity, it is presumed in the following that the reader is familiar with the material of1. The Counter-Example Consider a conjunctive RAS with four resources, < = fR1; R2; R3; R4g and supporting a single job with process plan